Fast and exact signed Euclidean distance transformation with linear complexity
نویسندگان
چکیده
We propose a new signed or unsigned Euclidean distance transformation algorithm, based on the local corrections of the well-known 4SED algorithm of Danielsson. Those corrections are only applied to a small neighborhood of a small subset of pixels from the image, which keeps the cost of the operation low. In contrast with all fast algorithms previously published, our algorithm produces perfect Euclidean distance maps in a time linearly proportional to the number of pixels in the image. The computational cost is close to the cost of the 4SSED approximation.
منابع مشابه
3-D Parallel Exact Signed Euclidean Distance Transform
The computation speed for distance transforms becomes important in a wide variety of image processing applications. Current ITK library filters do not see any benefit from a multithreading environment. We introduce a three-dimensional signed parallel implementation of the exact Euclidean distance transform algorithm developed by Maurer et al.[1] with a theoretical complexity of O(n/p) for n vox...
متن کاملParallel N-Dimensional Exact Signed Euclidean Distance Transform
The computation speed for distance transforms becomes important in a wide variety of image processing applications. Current ITK library filters do not see any benefit from a multithreading environment. We introduce an N-dimensional signed parallel implementation of the exact Euclidean distance transform algorithm developed by Maurer et al.[1] with a theoretical complexity of O(n/p) for n voxels...
متن کاملNew sequential exact Euclidean distance transform algorithms based on convex analysis
We present several sequential exact Euclidean distance transform algorithms. The algorithms are based on fundamental transforms of convex analysis: The Legendre Conjugate or Legendre–Fenchel transform, and the Moreau envelope or Moreau-Yosida approximate. They combine the separability of the Euclidean distance with convex properties to achieve an optimal linear-time complexity. We compare them ...
متن کاملFast Marker-based Algorithm for Exact Euclidean Distance Transformation
Euclidean distance transform is widely used in many applications of image analysis and pattern recognition. Traditional algorithms are time-consuming and complicated to realize. This paper proposes a fast marker-based distance transform algorithm. Firstly, mark the background pixels’ positions relative to the object pixels; secondly, scan the object area and define the first object pixel as the...
متن کاملThree Dimensional Fast Exact Euclidean Distance (3D-FEED) Maps
In image and video analysis, distance maps are frequently used. They provide the (Euclidean) distance (ED) of background pixels to the nearest object pixel. Recently, the Fast Exact Euclidean Distance (FEED) transformation was launched. In this paper, we present the three dimensional (3D) version of FEED. 3D-FEED is compared with four other methods for a wide range of 3D test images. 3D-FEED pr...
متن کامل